Papers with vector representations
Copied to clipboard
| Challenge: | COMBO is an end-to-end NLP system for accurate part-of-speech tagging, morphological analysis, and (enhanced) dependency parsing. |
| Approach: | They propose a fully neural NLP system for accurate part-of-speech tagging, morphological analysis, lemmatisation, and (enhanced) dependency parsing. |
| Outcome: | The proposed system predicts categorical morphosyntactic features whilst also exposes their vector representations, extracted from hidden layers. |
Copied to clipboard
| Challenge: | Existing linguistic knowledge bases such as URIEL+ lack a principled method for aggregating these signals into a single, comprehensive score. |
| Approach: | They propose a framework for type-matched language distances that unifies these signals into a robust, task-agnostic composite distance. |
| Outcome: | The proposed representations improve transfer performance when the distance type is relevant to the task, while yielding gains in most tasks. |
Copied to clipboard
| Challenge: | DeezyMatch is a free, open-source software library written in Python for fuzzy string matching and candidate ranking. |
| Approach: | They propose to use DeezyMatch to train new classifiers and fine-tune a pretrained model to generate rich vector representations from string inputs. |
| Outcome: | The proposed algorithm can be used to find the best matching candidates in large knowledge bases and query sets. |
Copied to clipboard
| Challenge: | Existing dependency parsers for Telugu use hand-crafted features based on linguistic information like part-of-speech and morphology which are expensive to annotate. |
| Approach: | They propose to replace linguistic feature templates with a minimal feature function for Telugu . they train a BERT model on the Telugus Wikipedia data and use contextual vector representations to train the parser. |
| Outcome: | The proposed parser achieves state-of-the-art for Telugu using contextual vector representations . the proposed model trains on the Telugus Wikipedia data and trains with a greedy transition based approach . |
Copied to clipboard
| Challenge: | Analogical reasoning is effective in capturing linguistic regularities. |
| Approach: | They propose to use Chinese lexical knowledge to build an analogical reasoning task using a large dataset. |
| Outcome: | The proposed dataset proves to be reliable benchmark for evaluating Chinese word embeddings. |
Copied to clipboard
| Challenge: | Existing retrieval methods rely on transforming user queries into vector representations and retrieving documents based on cosine similarity and static embeddings. |
| Approach: | They propose an inference-time logical reasoning framework that incorporates logical thinking into retrieval process. |
| Outcome: | The proposed method outperforms traditional retrieval methods on synthetic and real-world benchmarks on synthetic queries and datasets. |
Copied to clipboard
| Challenge: | a conversational system can learn to rank response candidates for a given dialogue context by computing similarity between their vector representations. |
| Approach: | They propose a framework that incorporates augmented dialogue contexts into the learning objective. |
| Outcome: | The proposed framework outperforms existing methods and is more robust to perturbations seen during inference. |
Copied to clipboard
| Challenge: | Word vector specialisation is a portable, light-weight approach to fine-tuning distributional word vector spaces by injecting external knowledge from rich lexical resources such as WordNet. |
| Approach: | They propose a constraint-driven vector space specialisation method that embeds external knowledge into lexical resources into a deep neural network to specialise unseen words. |
| Outcome: | The proposed method preserves useful linguistic knowledge for seen words while propagating external signal to unseen words to improve their vector representations. |
Copied to clipboard
| Challenge: | a growing number of language models are limiting their access to the community . we evaluate existing APIs for domain generalization and multilingual retrieval . |
| Approach: | They evaluate semantic embedding APIs in retrieval scenarios to assess their capabilities . they use BEIR and MIRACL to re-rank BM25 results using the APIs . |
| Outcome: | The proposed model is based on semantic embedding APIs that build vector representations of a given text. |
Copied to clipboard
| Challenge: | Existing work on how to learn refer-to-as relations from large unlabeled corpora lacks coreferential information. |
| Approach: | They propose to use Wikipedia to generate coreferential neural embeddings for nominals . they use coreference resolution as a proxy to evaluate the neural embeds for noun phrases . |
| Outcome: | The proposed dataset can be leveraged to construct representations for coreferential nominals from Wikipedia. |
Copied to clipboard
| Challenge: | Existing approaches for event extraction focus on sentence-level event extraction, but they lack a broader view of the document context. |
| Approach: | They build graphs with candidate event filler extractions enriched by sentential embeddings as nodes and use graph attention networks to identify event regions in a document and aggregate event information. |
| Outcome: | The proposed method performs well on two languages and shows that it is faster than previous methods. |
Copied to clipboard
| Challenge: | Existing zero-shot learning methods for multi-label text classification mostly learn a matching model between the feature space of text and the label space. |
| Approach: | They propose to use a graph encoder to incorporate label hierarchies to learn effective label representations on the zero-shot multi-label text classification problem. |
| Outcome: | The proposed approach outperforms previous non-pretrained methods on the zero-shot multi-label text classification task. |
Copied to clipboard
| Challenge: | Multimodal large language models (MLLMs) struggle with visual-based entity questions (VEQA) MLLM can identify A, but may refrain from answering due to privacy concerns. |
| Approach: | They propose a method that uses vector representations to analyze visual-based entity questions (VEQA) they use visual cues and textual information to integrate visual cus and visual information . |
| Outcome: | The proposed method significantly improves visual-based entity question answering (VEQA) it can identify faces, names, and alignments within visual objects, and then derive the answer over this matching graph. |
Copied to clipboard
| Challenge: | Embedding words in vector space is a fundamental first step in state-of-the-art natural language processing. |
| Approach: | They propose to embed words in vector space using propositional logic instead of dense vectors . they evaluate embeddings on intrinsic and extrinsic benchmarks and visualize word clusters based on their results . |
| Outcome: | The proposed model outperforms GLoVe on six classification tasks. |
Copied to clipboard
| Challenge: | Existing word embeddings for lowresource languages require large corpora of running text to learn high quality representations. |
| Approach: | They leverage a bilingual dictionary to learn Wolastoqey word embeddings by encoding their corresponding English definitions into vector representations using pretrained English word and sequence representation models. |
| Outcome: | The proposed model outperforms baseline models without language-specific training or fine-tuning. |
Copied to clipboard
| Challenge: | Existing methods for Knowledge Graph (KG) alignment are not satisfactory. |
| Approach: | They propose a method that directly learns embeddings of entity-pairs for KG alignment. |
| Outcome: | The proposed approach can achieve state-of-the-art on five real-world datasets. |
Copied to clipboard
| Challenge: | Dense retrieval models based on text representations have proven very effective, but when applied off-the-shelf they often experience a severe drop in performance. |
| Approach: | They propose to interpret the vector representations produced by dual encoders by projecting them into the model’s vocabulary space. |
| Outcome: | The proposed model significantly improves on the BEIR benchmark and in zero-shot settings. |
Copied to clipboard
| Challenge: | Existing approaches to pre-training focus on embedding alignment, but they neglect the modeling of bidirectional contexts. |
| Approach: | They propose a framework to learn languageuniversal representations using multi-granularity contrasting framework . they encode semantic equivalents from different languages into similar representations . |
| Outcome: | The proposed framework can achieve significant performance gains in machine translation and cross-lingual language understanding. |
Copied to clipboard
| Challenge: | Recent work has focused on vector representations which capture different meanings, i.e., senses, of words. |
| Approach: | They propose a bidirectional LSTM model which learns word senses from semantically annotated corpora by focusing on word order. |
| Outcome: | The proposed model achieves state-of-the-art on the SemEval-2014 word-to-sense similarity task and is available online at http://lcl.uniroma1.it/LSTMEmbed. |
Copied to clipboard
| Challenge: | Word-by-word language model surprisal is often used to model the incremental processing of human readers, but has been overlooked in cognitive modeling due to the granularity of subword tokens. |
| Approach: | They propose to manipulate token granularity to account for processing difficulty of naturalistic text and garden-path constructions. |
| Outcome: | The proposed model can account for the processing difficulty of naturalistic text and garden-path constructions by using tokens defined by a vocabulary size of 8,000. |
Copied to clipboard
| Challenge: | Existing methods provide probabilistic guarantees over a reference set of queries and answers, but they fail to identify when the answers to a query are uncertain. |
| Approach: | They propose a method that approximates predicate-conditional coverage guarantees while maintaining compact prediction sets. |
| Outcome: | The proposed method provides predicate-conditional coverage guarantees while maintaining compact prediction sets. |
Copied to clipboard
| Challenge: | Existing word embeddings capture a range of semantic relations relevant to the interpretation of lexical items, but domain-specific terms are difficult to evaluate because of a lack of statistical clues in the underlying corpus. |
| Approach: | They conduct intrinsic and extrinsic evaluations of both general and domain-specific embeddings and adapt embeddment enhancement methods to provide vector representations for infrequent and unseen terms. |
| Outcome: | The proposed model improves both in the intrinsic evaluation and extrinsic evaluation of the embedding models and their representations of infrequent and unseen terms. |
Copied to clipboard
| Challenge: | Existing methods to model answer selection(AS) are based on feature engineering and resource toolkits. |
| Approach: | They propose a model that captures features and information from question and answer text and repeats multiple times(hops) in a sequential fashion. |
| Outcome: | The proposed model performs on answer selection tasks and multi-level answer ranking tasks. |
Copied to clipboard
| Challenge: | Existing approaches to sequence labeling are based on the neural linear-chain CRF model. |
| Approach: | They propose a series of increasingly expressive potential functions for neural CRF models that integrate emission and transition functions and explicitly take contextual words as input. |
| Outcome: | The proposed model consistently achieves the best performance on the decomposed quadrilinear potential function based on the representations of two neighboring labels and two neighbored words. |
Copied to clipboard
| Challenge: | a Content-based document alignment approach is an efficient way to align multilingual web documents based on content. |
| Approach: | They propose a Content-based document alignment approach to align multilingual web documents based on content in parallel training data for machine translation systems. |
| Outcome: | The proposed method achieves comparable performance with state-of-the-art systems in the WMT-16 Bilingual Document Alignment Shared Task benchmark while operating in multilingual space. |
Copied to clipboard
| Challenge: | Standard word embedding algorithms learn vector representations from large corpora of text documents in unsupervised fashion. |
| Approach: | They propose an algorithm that learns word embeddings jointly with a classifier . their algorithm leverages document label information to learn vector representations of words . |
| Outcome: | The proposed algorithm has superior performance on domains with limited data compared to other methods. |
Copied to clipboard
| Challenge: | Pretrained audio-language models such as AudioCLIP and AudioCLAP have shown promising results on vision-language (VL) tasks. |
| Approach: | They extensively evaluate how unsupervised and supervised sentence embedding training affect language encoder quality and cross-modal task performance. |
| Outcome: | The proposed model improves on visual-language (VL) and audio-language tasks when the amount of training data is large. |
Copied to clipboard
| Challenge: | Numerical data is pivotal for medical questions and answers, but tabular data is not fully integrated into LLMs. |
| Approach: | They examine the effectiveness of vector representations from last hidden states of LLMs for medical diagnostics and prognostics using electronic health record data. |
| Outcome: | The proposed representations outperform those using raw numerical EHR data in medical diagnostics and prognostics. |
Copied to clipboard
| Challenge: | Existing methods produce only point estimates, without quantifying predictive uncertainty—limiting their reliability in high-stakes applications where understanding confidence in predictions is crucial. |
| Approach: | They propose a framework that generates prediction intervals guaranteed to contain the true score with a user-specified level of confidence. |
| Outcome: | The proposed framework generates prediction intervals guaranteed to contain the true score with a user-specified level of confidence. |
Copied to clipboard
| Challenge: | Existing methods do not specifically pre-train reasonable embeddings for targets and aspects in TABSA. |
| Approach: | They propose to refine the embeddings of targets and aspects using a sparse coefficient vector . this allows the embeds to be refined from highly correlative words instead of context-independent vectors . |
| Outcome: | Experiments show that the proposed method improves on two benchmark datasets. |
Copied to clipboard
| Challenge: | URIEL is limited in terms of linguistic inclusion and overall usability . URIel+ provides robust, customizable distance calculations to better suit the needs of users. |
| Approach: | They propose a new version of URIEL and a query tool that provides a standardized approach to representing languages as geographical, phylogenetic, and typological vectors. |
| Outcome: | URIEL+ expands the user experience with robust, customizable distance calculations to better suit the needs of users. |
Copied to clipboard
| Challenge: | Existing approaches to find relevant passages using sparse keywords are not effective for open domain question answering. |
| Approach: | They propose a new contrastive learning method for learning a dual-encoder model for question-passage matching using a large pool of negative samples. |
| Outcome: | The proposed method maintains large pool of negative samples and optimizes question-to-passage and passage-to question matching tasks. |
Copied to clipboard
| Challenge: | Multiple choice questions can be graded automatically, but automated short answer grading is time-consuming and has bias and errors. |
| Approach: | They propose a Semantic Feature-wise transformation Relation Network that captures relational knowledge among the questions, reference answers or rubrics and labeled student answers. |
| Outcome: | The proposed model has up to 11% performance improvement over state-of-the-art approaches on the benchmark SemEval-2013 datasets, and surpasses custom approaches designed for a Kaggle challenge. |
Copied to clipboard
| Challenge: | a method to normalize multi-word terms with concepts from a domain-specific ontology is proposed . a large part of knowledge is expressed in textual form, such as in scientific articles . |
| Approach: | They propose a method to normalize multi-word terms with concepts from a domain-specific ontology. |
| Outcome: | The proposed method outperforms existing methods on a categorization task in bacterial habitats . the results are encouraging, and the proposed method is expected to be widely used in the biomedical/biological field . |
Copied to clipboard
| Challenge: | Compound words provide a multifaceted challenge for diachronic models of semantic change . novel sense-targeting approach targets both noun compounds and their constituent parts . |
| Approach: | They propose a dataset of relatedness judgements of noun compounds in English and german . they use contrasting vector representations to evaluate their ability to cluster example sentence pairs . |
| Outcome: | The proposed approach captures diachronic meaning changes for multi-word expressions without condensing individual senses into an aggregate value. |
Copied to clipboard
| Challenge: | Existing RAG systems rely on flat data representations and inadequate contextual awareness . lightRAG framework incorporates graph structures into text indexing and retrieval processes . |
| Approach: | LightRAG is a framework that integrates graph structures into text indexing and retrieval processes. |
| Outcome: | The proposed framework incorporates graph structures into text indexing and retrieval processes. |
Copied to clipboard
| Challenge: | Existing methods to induce grammars of multiple languages do not consider language similarity measures. |
| Approach: | They propose a universal grammar induction approach that captures similarity between languages . they use vector representations to capture similarity and softly tie grammar parameters . |
| Outcome: | The proposed approach performs well over monolingual and multilingual datasets. |
Copied to clipboard
| Challenge: | Existing methods for humor recognition require a large amount of training data with labels to learn effective features. |
| Approach: | They propose a tensor embedding method that can extract lexical humor features for continuous humor recognition by using word-word co-occurrence to encode contextual content of documents, and then decompose the tenor to get corresponding vector representations. |
| Outcome: | The proposed method achieves a distance of 0.887 on a global humor ranking task, comparable to the top performing systems from SemEval 2017 Task 6B, but without the need for any external training corpus. |
Copied to clipboard
| Challenge: | Existing studies have used probing tasks to verify the presence of linguistic properties in vector representations, but it is unclear whether they can be manipulated to indirectly steer them. |
| Approach: | They validate a geometric mapping technique to transform linguistic properties without tuning . they use a pre-trained multilingual autoencoder to transform three linguistic property . |
| Outcome: | The proposed method can be used without tuning of the pre-trained autoencoder . the results are validated in monolingual and cross-lingual settings . |
Copied to clipboard
| Challenge: | Off-the-shelf string matching methods are widely used to link entities across datasets, but they are not available for many settings. |
| Approach: | They propose to use augmented digital fonts to measure character substitution costs for OCR’ed documents by using vision transformers. |
| Outcome: | The proposed method significantly improves record linkage compared to other string matching methods. |
Copied to clipboard
| Challenge: | Sentence-level representations are beneficial for various natural language processing tasks. |
| Approach: | They propose a generative embedding inversion attack that reconstructs input sequences based only on their sentence embeddeds. |
| Outcome: | The proposed model outperforms previous embedding inversion attacks in classification metrics and generates coherent and contextually similar sentences as original inputs. |
Copied to clipboard
| Challenge: | Existing studies focus on modeling context-sensitive dependencies and knowledge-sensitive dependences. |
| Approach: | They propose a framework based on contrastive learning called CKCL to distinguish utterances for better vector representations. |
| Outcome: | The proposed framework outperforms state-of-the-art models on four datasets. |
Copied to clipboard
| Challenge: | Existing approaches to learn sentence embeddings do not capture the semantic similarity of sentences. |
| Approach: | They propose a framework that integrates compositional sentence operations into the embedding space and optimizes operator networks and a bottleneck encoder-decoder model to produce meaningful and interpretable sentence embeddables. |
| Outcome: | The proposed framework improves the interpretability of sentence embeddings on four textual generation tasks while maintaining strong performance on traditional semantic similarity tasks. |
Copied to clipboard
| Challenge: | Despite significant progress in multimodal language models, it remains unclear whether visual grounding enhances their understanding of embodied knowledge compared to text-only models. |
| Approach: | They propose to assess vision-language models’ perceptual abilities across different sensory modalities through vector comparison and question-answering tasks with over 1,700 questions. |
| Outcome: | The proposed benchmark assesses the models’ perceptual abilities across different sensory modalities through vector comparison and question-answering tasks with over 1,700 questions. |
Copied to clipboard
| Challenge: | Large language models encode textual information using high-dimensional latent spaces . many studies have investigated how conceptual content of words translates into geometrical relationships between their vector representations . |
| Approach: | They use literary pieces to show that intangible, rather than factual, aspects of the prompt are contained in deep representations. |
| Outcome: | The results show that word-to-vec(tor) embeddings are more complex than other models. |
Copied to clipboard
| Challenge: | Existing embedding models excel at capturing general meaning, but overlook ideological nuances, limiting their effectiveness in political bias tasks. |
| Approach: | They propose a framework to Produce inteRpretable polItical biaS eMbeddings. |
| Outcome: | The proposed framework outperforms state-of-the-art embedding models in political bias classification . the proposed framework offers highly interpretable representations for political analysis . |